Distributed seamless roaming in wireless networks

ABSTRACT

One embodiment of the present invention provides a system for configuring an access point in a wireless network. During operation, the access point discovers one or more existing access points associated with the wireless network. The access point then obtains a set of configuration information from one existing access point, and synchronizes a local timestamp counter to a selected existing access point, thereby allowing the access point to be configured without using a centralized management station.

RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.13/763,537, Attorney Docket Number UBNT12-1007NP, entitled “DISTRIBUTEDSEAMLESS ROAMING IN WIRELESS NETWORKS,” by inventors Sriram Dayanandan,Bo-chieh Yang, Yuan-Hsiang Lee, Keh-Ming Luoh, and Robert J. Pera, filed8 Feb. 2013, which claims the priority to U.S. Provisional PatentApplication No. 61/716,431 (Attorney Docket Number UBNT12-1007PSP),filed 19 Oct. 2012, entitled “Distributed Seamless Roaming in WirelessNetworks.”

BACKGROUND

1. Field

This disclosure is generally related to wireless networks. Morespecifically, this disclosure is related to a method and system forfacilitating seamless roaming in a wireless network.

2. Related Art

In recent years, the phenomenal growth of mobile devices, such as smartphones and tablet computers, has resulted in a huge demand in wirelessnetworks. Particularly, Wi-Fi networks, which are based on theIEEE-802.11 family of standards, are becoming increasingly ubiquitous.In a typical Wi-Fi network, an end-user station can move freely withinthe range of an access point's (AP's) radio transceiver whilemaintaining high-speed data connectivity.

In a large-scale network, such as an enterprise or campus network,provisioning such a Wi-Fi network is non-trivial. One challenge is howto cover a large area with multiple APs, while providing a user with theexperience that when he changes his location he remains within the sameWi-Fi network, and his device continues to communicate with the same AP.Typically, end-user stations tend to be “sticky.” That is, a station isunlikely to change the physical AP it communicates with unless it isabsolutely necessary, due to the handover overhead (such as disruptionto communication). Also, APs have more transmission power than stations.Hence, a station might “hear” an AP loud and clear, but the AP might notbe able to receive reliably signals transmitted by the station.

Currently, to facilitate a large-scale Wi-Fi network that uses multipleAPs, a centralized switch and management station is used to coordinateall the APs. This centralized approach is costly, requires a significantamount of configuration, and presents a single point of failure in thenetwork.

SUMMARY

One embodiment of the present invention provides a system forconfiguring an access point in a wireless network. During operation, theaccess point discovers one or more existing access points associatedwith the wireless network. The access point then obtains a set ofconfiguration information from one existing access point, andsynchronizes a local timestamp counter to a selected existing accesspoint, thereby allowing the access point to be configured without usinga centralized management station.

In a variation on this embodiment, the set of configuration informationcomprises a group or broadcast/multicast encryption key.

In a variation on this embodiment, the set of configuration informationcomprises an association ID (AID) usage indication which indicates oneor more AIDs currently in use by the one or more existing access points.

In a further variation, the AID usage indication is an AID usage bitmap.In addition, a respective bit of the AID usage bitmap corresponds to anAID and indicates whether the AID is used by any access point in thewireless network.

In a variation on this embodiment, synchronizing the local timestampcounter to the selected existing access point involves selecting theexisting access point based on timestamp hierarchy associated with theone or more existing access points.

In a variation on this embodiment, discovering the one or more existingaccess points comprises transmitting a broadcast discovery message on awired network.

One embodiment of the present invention provides a system forassociating a user station with an access point in a wireless network.During operation, the access point receives a first authenticationpacket from the user station. The access point then places the userstation in an association-arbitration list. Subsequently, the accesspoint broadcasts signal-strength indication associated with the userstation, and receives signal-strength indication associated with theuser station from other access points in the wireless network. Theaccess point then determines whether the access point has the bestsignal strength associated with the user station, and in response to theaccess point having the best signal strength, associates the userstation with the access point.

In a variation on this embodiment, the access point waits for apredetermined period of time prior to determining whether the accesspoint has the best signal strength, thereby allowing sufficient time forreceiving signal-strength indication from other access points.

In a variation on this embodiment, associating the user station with theaccess point involves assigning an AID to the user station and setting abit in an AID usage bitmap, wherein the bit corresponds to the assignedAID. Furthermore, the access point broadcasts the AID usage bitmap toother access points in the wireless network.

In a variation on this embodiment, the access point determines that thesignal strength associated with the user station is below apredetermined threshold. The access point then queries other accesspoints for their signal strength associated with the same user station.In response to there being at least one other access point receiving asufficiently strong signal from the user station, the access point handsover the user station to the access point with the strongest signalstrength.

In a variation on this embodiment, the access point hands over one ormore user stations associated with the access point to one or more otheraccess points. Subsequently, the access point performs maintenance onaccess point without disruption to service for the one or more userstations that have been handed over.

In a further embodiment, while performing the maintenance, the accesspoint upgrades its firmware or performs spectrum scanning.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 illustrates an exemplary Wi-Fi network that facilitates seamlessstation roaming, in accordance with one embodiment of the presentinvention.

FIG. 2 presents a flowchart illustrating an exemplary discovery and keysynchronization process for a new AP joining an RC, in accordance withone embodiment of the present invention.

FIG. 3 presents a timing diagram illustrating the process ofsynchronizing the timestamp counter of a local AP to the timestampcounter of a remote AP, in accordance with one embodiment of the presentinvention.

FIG. 4 presents a flowchart illustrating an exemplary process of astation joining an AP, in accordance with one embodiment of the presentinvention.

FIG. 5 presents a flowchart illustrating an exemplary process ofmonitoring an associated station and initiating station roaming, inaccordance with one embodiment of the present invention.

FIGS. 6A, 6B, and 6C illustrate an exemplary process of performingrolling maintenance on a number of APs without service disruption, inaccordance with one embodiment of the present invention.

FIG. 7 illustrates an exemplary AP system that facilitates seamlessroaming in a Wi-Fi network, in accordance with one embodiment of thepresent invention.

DETAILED DESCRIPTION

The following description is presented to enable any person skilled inthe art to make and use the embodiments, and is provided in the contextof a particular application and its requirements. Various modificationsto the disclosed embodiments will be readily apparent to those skilledin the art, and the general principles defined herein may be applied toother embodiments and applications without departing from the spirit andscope of the present disclosure. Thus, the present invention is notlimited to the embodiments shown, but is to be accorded the widest scopeconsistent with the principles and features disclosed herein.

Embodiments of the present invention solve the problem of facilitatingseamless roaming in a Wi-Fi network by using APs that can join anexisting cluster of APs of the same Wi-Fi network with automaticconfiguration, without the need of a centralized management station. Inparticular, when a new AP joins an existing Wi-Fi network, the new APcan automatically synchronize its clock to the existing APs, obtain allthe configuration information, and associate with and handover roamingstations with seamless transition without the need to use a centralizedmanagement station or controller.

FIG. 1 illustrates an exemplary Wi-Fi network that facilitates seamlessstation roaming, in accordance with one embodiment of the presentinvention. In this example, a Wi-Fi network 100 includes a number ofAps, 102, 104, 106, 108, and 110, which are coupled to a layer-2 (e.g.,Ethernet) switch 101 via wired links. A user station 120 participates inWi-Fi network 100 by communicating with one of the APs. Note that switch101 is only a layer-2 switch, and is not required to configure APs as aconventional centralized management station does.

The challenge in provisioning a Wi-Fi network, like network 100, is howto make all APs work together, so that from a user's perspective,station 120 appears to be communicating with only one physical AP asstation 120 moves around in network 100. To achieve this goal, someembodiments of the present invention employs several automaticconfiguration mechanisms to allow an AP to join an existing Wi-Finetwork.

In general, a Wi-Fi network like network 100 has a unique medium accesscontrol (MAC) address (also known as basic service set identification(BSSID)). Also, network 100 has a network name (also known as Serviceset identification (SSID)). Wi-Fi network 100 also has a radio frequencyof operation, which governs the transceiver frequency of all the APradios, and a security profile, which controls authentication ofstations and encryption/decryption of wireless data traffic. Hence, aWi-Fi network, or a wireless basic service set (WB), is uniquelyidentifiable by:

WB_(i)=(BSSID, SSID, frequency, security profile).

Furthermore, two or more APs that implement the same WB can form aroaming cluster (RC). In the example illustrated in FIG. 1, network 100is one RC. Typically, an RC is configured with a unique encryption keyset by the network administrator. In addition, each AP has a timestampcounter, or timing synchronization function (TSF), which can be a 32 or64-bit micro-second counter maintained by the radio chipset.

During operation, when a new AP joins an existing RC, the AP performsfollowing operations: (1) discovery and key synchronization; and (2)timestamp synchronization. The discovery and key synchronization processis for the new AP to acquire knowledge of the RC and some basicinformation needed for communication within the RC. Timestampsynchronization is necessary for all the AP in the RC to behave like oneAP. In other words, when a station roams from one AP to another, thepackets coming from the APs should have consistent timestamps. Thediscovery and key synchronization and timestamp synchronizationprocesses are described in more details below.

When a new AP joins an existing RC such as network 100, the new AP isfirst plugged into layer-2 switch 101. The AP then multicasts on thewired network via layer-2 switch 101 a discover message to all other APsin the same RC.

If one or more other APs belonging to the same RC exist, they respond tothe discover message with the following information: (1) group orbroadcast/multicast encryption key; and (2) 802.11 Association ID (AID)usage bitmap. The group encryption key is used to encrypt broadcast ormulticast traffic, and is common to the entire RC. If no other member APin the same RC exists, the new AP generates a unique group orbroadcast/multicast encryption key.

The AID usage bitmap indicates a member AP's current association withuser stations. An AID is a unique identifier that identifies a userstation associated with a particular AP. Generally, the AID value islocally unique to a particular AP. In embodiments of the presentinvention, since an RC contains multiple APs that behave as one singleAP, the AIDs assigned to the user stations need to be cluster-wideunique. In one embodiment, all member APs maintain an AID bitmap. Arespective bit in this AID bitmap (e.g., a value of “1”) indicateswhether the AID value corresponding to that bit is used by a station.Hence, when the new AP joins an RC, the received AID bitmap indicateswhat AID values are still available.

The aforementioned automatic configuration process allows an AP to joinan existing network and a user station to roam seamlessly within thewireless network without using a centralized controller or managementstation.

FIG. 2 presents a flowchart illustrating an exemplary discovery and keysynchronization process for a new AP joining an RC, in accordance withone embodiment of the present invention. During operation, the new APfirst broadcasts a discovery message on the wired network (operation202). Next, the new AP determines whether it has received response fromother AP(s) in the same RC (operation 204). If no response has beenreceived, the new AP generates the group or broadcast/multicastencryption key (operation 208). If at least one response is received,the new AP obtains the group or broadcast/multicast encryption key andthe AID bitmap for the RC (operation 206).

As mentioned above, another task the new AP may perform is tosynchronize its TSF with other member APs. In one embodiment, the new APscans its radio for beacon packets transmitted wirelessly from thediscovered member APs belonging to the same RC. In general, a beaconpacket includes the TSF value (time of transmission) and aTSF-HIERARCHY-ID of the transmitting AP. The TSF-HIERARCHY-ID indicatesthe hierarchy in which an AP derives its TSF. For example, the veryfirst AP for an RC has a TSF-HIERARCHY-ID of 0. Other APs that derivetheir TSF values from the first AP have a TSF-HIERARCHY-ID of 1, and soforth. Hence, for an AP, the lower the TSF-HIERARCHY-ID value is, themore accurate timing it has.

After receiving beacon packets from other APs, the new AP selects the APwhose beacon packet contains the lowest TSF-HIERARCHY-ID value, andsynchronizes the local TSF with the selected AP. In addition, the new APsets its own TSF-HIERARCHY-ID to be the lowest TSF-HIERARCHY-ID+1.

FIG. 3 presents a timing diagram illustrating the process ofsynchronizing the timestamp counter of a local AP to the timestampcounter of a remote AP, in accordance with one embodiment of the presentinvention. During operation, the local AP first receives a timing beaconpacket 302 from a remote AP, wherein beacon packet 302 contains the TSFvalue of the remote AP when beacon packet 302 was transmitted (denotedas time “RTSF”). When the local AP receives beacon packet 302, the valueof its TSF is denoted as “LTSF,” which is contained in a receivedescriptor that accompanies the received beacon packet.

Next, the local AP sends the remote AP an “ECHO REQUEST” packet 304 overthe radio to the remote AP. The local time of transmission of echorequest packet 304 is denoted as “ERQTTSF” (which stands for “echorequest transmit TSF”). When echo request packet 304 reaches the remoteAP, the remote AP's TSF value is denoted as “ERQRTSF” (which stands for“echo request receive TSF”).

Subsequently, at time ERSTTSF (which stands for “echo response transmitTSF”), the remote AP transmits an first “ECHO RESPONSE” packet 306,which is in turn received by local AP at time ERSRTSF (which stands for“echo response receive TSF”). Shortly after, the remote AP sends asecond echo response packet 308, which contains the value of ERSTTSF.This way, local AP has all the information it needs to calculate aone-way time-of-flight (TOF) delay between the local AP and the remoteAP. This TOF is calculated as:

TOF=((ERQRTSF−ERQTTSF)+(ERSRTSF−ERSTTSF))/2.

That is, the round-trip time (RTT, which is twice the TOF) between thelocal AP and remote AP can be calculated as Δ1−Δ2, as illustrated inFIG. 3. Note that Δ1=(ERSRTSF−ERQTTSF); and Δ2=(ERSTTSF−ERQRTSF). Hence,RTT=(ERSRTSF−ERQTTSF)−(ERSTTSF−ERQRTSF)=2×TOF.

Subsequently, the local AP synchronizes its local TSF as follows:

TSF=RTSF+(LNTSF−LTSF)+TOF;

wherein LNTSF is the current TSF reading at the local AP.

After the new AP successfully joins the RC, a station can now beassociated with the newly joined AP. FIG. 4 presents a flowchartillustrating an exemplary process of a station joining an AP, inaccordance with one embodiment of the present invention. Duringoperation, an AP first receives an AUTHENTICATION packet from a station(operation 402). The AP maintains an “ASSOCIATION-ARBITRATION” list,which temporarily holds the MAC addresses of stations that are in theprocess of associating with the AP. The AP then determines whether thestation from which the authentication packet is received is in theASSOCIATION-ARBITRATION list (operation 404). If the station is not inthe ASSOCIATION-ARBITRATION list, which means that this is the firsttime that the station attempts to associate with the AP, the AP adds thestation to the ASSOCIATION-ARBITRATION list with a timestamp, and sendsa multicast packet on the wired network with the station's MAC addressand a relative signal strength indicator (RSSI) value based on thereceived authentication packet (operation 406). This operation allowsall the APs in the RC to note down the RSSI with regard to the otherAPs. Next, the AP waits for the station to send another authenticationpacket (operation 402).

If the MAC address of the station already exists in theASSOCIATION-ARBITRATION list, the AP determines whether the timestampassociated with the station's entry in the ASSOCIATION ARBITRATION tableis less than TIMEOUT old (operation 408). If so, the AP does not doanything and waits for the next authentication packet from the samestation (operation 402). This waiting period gives all the APs that can“hear” the station sufficient time to exchange their respective RSSIinformation.

If the timestamp is more than TIMEOUT old, the AP further determineswhether itself has the highest RSSI for the station (operation 410).This step allows all the APs that can “hear” the station to elect amongthemselves the AP that can “hear” the station the best. If the local APis the not the one with the highest RSSI, it deletes the station's MACaddress from its ASSOCIATION-ARBITRATION list (operation 411). If thelocal AP has the highest RSSI, it first deletes the station's MACaddress from the ASSOCIATION-ARBITRATION list (operation 412). Note thatall other APs that have received the station's authentication packetalso delete the station from their respective ASSOCIATION-ARBITRATIONlist. Additionally, all APs purge unused entries from theASSOCIATION-ARBITRATION list in the event that no further AUTHENTICATIONpacket is received.

Next, the local AP responds to the station with an AUTHENTICATIONresponse packet (operation 414). The local AP further receives anASSOCIATION packet from the station (operation 415). Subsequently, theAP performs a set of security procedures with the station (operation416). Such procedures may include 802.11i, WPA, or WPA2 securityoperations. Lastly, the AP sends a multicast “ASSOCIATION NOTIFICATION”message on the wired network to all APs in the RC (operation 418). ThisASSOCIATION NOTIFICATION message contains the station's MAC address andits newly assigned AID. In response, all the APs can update their AIDbitmap to reflect the new AID assigned to the station.

When a station disassociates with an AP, the AP can send a multicast“DISASSOCIATION NOTIFICATION” message to all other APs. In response, allthe APs update their AID bitmaps to release the AID previously assignedto the disassociated station.

One utility of some embodiments of the present invention is that astation can freely and seamless roam within the Wi-Fi network, where APscan handle station handover automatically. To facilitate such seamlessroaming, an AP currently associated with a station regularly monitorsthe RSSI for that station, and when the RSSI drops below a certainthreshold, the AP selects from other APs one that has the best RSSI, andhandover the station. In one embodiment, an AP uses three parameters tocontrol the handover: RSSI check interval (RCI), RSSI check threshold(RCT), and RSSI check switch threshold (RCST). During operation, an APchecks the RSSI for a station regularly at each RCI. If the RSSI fallsbelow RCT, the AP queries all other APs for their RSSI corresponding tothe same station (even if the other APs are not associated with thestation). If the difference between the current AP's RSSI and anotherAP's RSSI is greater than RCST, the current AP hands over the station tothe other AP.

Note that, since all APs in the RC use the same frequency, any AP canobserve the signal strength for stations associated with another memberAP which is in its vicinity. In one embodiment, when an AP receives adata packet from a station that is not in its associated station list,the AP makes an entry for the station in its “OTHER-AP-STATIONS” list,along with the RSSI of the received packet. If such an entry alreadyexists, the AP shall average the RSSI value over multiple RCI periods.Additionally, an AP age out entries in the “OTHER-AP-STATIONS” list ifthe AP stops receiving packets from such stations.

FIG. 5 presents a flowchart illustrating an exemplary process ofmonitoring an associated station and initiating station roaming, inaccordance with one embodiment of the present invention. Duringoperation, an AP queries the RSSI value of all the associated stationsin each RCI period (operation 502). In one embodiment, if the lastreceived packet from a station was received more than 4 RCI periods ago,the RSSI value for that station is set to 0.

Subsequently, the AP determines whether an associated station's RSSI isless than RCT (operation 504). If not, the AP continues to monitor theRSSI for all associated stations (operation 502). If a stations RSSIfalls below RCT, the AP sends out a multicast query message to all theAPs with the station's MAC address (operation 506). Upon receiving thequery message, all APs consult their respective “OTHER-AP-STATIONS” listand respond back with a “STA-QUERY-RESPONSE” message indicating theaverage RSSI for that station. In response the AP receives RSSI valuesfrom the other APs (operation 508). The AP then determines whether thedifference between the best RSSI value received from another AP and itsown RSSI is greater than RCST (operation 510). If not, the AP continuesto monitor the RSSI for all the associated stations (operation 502).

If the RSSI difference is greater than RCST, the AP hands over thestation to the new AP (operation 512). In one embodiment, the current APsends a “HANDOVER REQUEST” message to the target AP. In response, thetarget AP sends a “SWITCH REQUEST” message back to the current AP, whichin turn responds with a “SWITCH RESPONSE” message that contains:

-   -   (1) the station's AID;    -   (2) 802.11 association information elements, such as listen        interval, capability; WPA/RSN, HT capabilities, etc.;    -   (3) 802.11i/WPA2/WPA station information, e.g., PTK, PMK, etc.;        and    -   (4) 802.11 block-ACK and aggregation states for various TIDs.

Upon receiving all the station information, the target AP adds thestation to its list of associated stations. In addition, the target APconducts a roaming switch. That is, the target AP sends a dummy packetto the layer-2 switch via the wired network with the station's MACaddress as the packet's source MAC address. This way, the layer-2 switchcan update its MAC forwarding table accordingly, and forward futurepackets destined for the station to the target AP.

Subsequently, the current AP flushes out any remaining packets in itsbuffers before removing the station from its associated station list.

Note that the roaming process can be used for software upgrades withoutdisruption. Normally, the process of conducting firmware upgrades isdisruptive to the users. When using the roaming process described above,an AP can first hand over all its associated stations to the bestalternative AP before upgrading itself. After the upgrade, the next APcan conduct the upgrade in a similar manner. Hence, the entire networkcan be upgraded without any network disruption.

Furthermore, embodiments of the present invention facilitate spectrumscans without disruption. Normally, APs conduct spectrum scans atstartup. Since the RF environment is dynamic, spectrum scans need to beconducted at regular intervals in order to use the best availablefrequency. Using the roaming process described above, an AO can firsthand over all its associated stations to the best alternative APs beforeconducting a spectrum scan. In addition, the APs can repeat this scanprocess across the network to decide the best frequency based on theinput from all APs.

FIGS. 6A, 6B, and 6C illustrate an exemplary process of performingrolling maintenance on a number of APs without service disruption, inaccordance with one embodiment of the present invention. Initially, asillustrated in FIG. 6A, APs 602, 604, 606, and 608 are deployed. AP 602is associated with user stations 612, 614, and 616; and AP 604 isassociated with user stations 612 and 614. When the system needs toconduct rolling maintenance (such as firmware upgrade or spectrum scan),the system first selects an AP to start with.

As illustrated in FIG. 6B, the first AP to undergo maintenance is AP602. Correspondingly, AP 602 disassociates itself from user stations612, 614, and 616, and hand them over to other APs. Specifically, userstations 612 and 614 are handed over to AP 606, and user station 616 ishanded over to AP 604. (The new association is indicated by dottedlines.) After AP 602 disassociates itself from all the user stations, AP602 can now perform the maintenance.

Subsequently, when the maintenance operation on AP 602 is complete, asshown in FIG. 6D, user stations 612, 614, and 616 are handed over backto AP 602. In addition, the next AP, which in this example 604, repeatsthe same procedure. That is, AP 604 hands over its associated userstations 612 and 614 to AP 606 and AP 608, respectively. After thehand-over, AP performs the maintenance procedure.

Alternatively, after the maintenance on AP 602 is complete, userstations 612, 614, and 616 may remain associated with their then-currentAPs (that is, user stations 612 and 614 remain associated with AP 606).

The aforementioned rolling maintenance process can repeat for eachdeployed AP, until all APs in the network has gone through the samemaintenance process.

Exemplary AP System

FIG. 7 illustrates an exemplary AP system that facilitates seamlessroaming in a Wi-Fi network, in accordance with one embodiment of thepresent invention. In this example, an AP system 700 includes aprocessor 702, a memory 704, and a communication module 706, which caninclude a radio transceiver and an antenna (not shown).

Also included in AP system are a synchronization module 708, a stationassociation module 710, and a station handover module 712. Duringoperation, synchronization module 708 performs time synchronization withother APs, as described in conjunction with FIG. 3. Station associationmodule 710 performs the station association process described inconjunction with FIG. 4. Station handover module 712 facilitates stationroaming, as described in conjunction with FIG. 5.

The methods and processes described in the detailed description sectioncan be embodied as code and/or data, which can be stored in acomputer-readable storage device as described above. When a computersystem reads and executes the code and/or data stored on thecomputer-readable storage device, the computer system performs themethods and processes embodied as data structures and code and storedwithin the computer-readable storage medium.

Furthermore, methods and processes described herein can be included inhardware modules or apparatus. These modules or apparatus may include,but are not limited to, an application-specific integrated circuit(ASIC) chip, a field-programmable gate array (FPGA), a dedicated orshared processor that executes a particular software module or a pieceof code at a particular time, and/or other programmable-logic devicesnow known or later developed. When the hardware modules or apparatus areactivated, they perform the methods and processes included within them.

The foregoing descriptions of various embodiments have been presentedonly for purposes of illustration and description. They are not intendedto be exhaustive or to limit the present invention to the formsdisclosed. Accordingly, many modifications and variations will beapparent to practitioners skilled in the art. Additionally, the abovedisclosure is not intended to limit the present invention.

What is claimed is:
 1. A method for associating a user station with anaccess point in a wireless network, comprising: receiving a firstauthentication packet from the user station; placing the user station inan association-arbitration list; broadcasting signal-strength indicationassociated with the user station; receiving signal-strength indicationassociated with the user station from other access points in thewireless network; determining whether the access point has the bestsignal strength associated with the user station; and in response to theaccess point having the best signal strength, associating the userstation with the access point.
 2. The method of claim 1, furthercomprising waiting for a predetermined period of time prior todetermining whether the access point has the best signal strength,thereby allowing sufficient time for receiving signal-strengthindication from other access points.
 3. The method of claim 1, whereinassociating the user station with the access point comprises: assigningan AID to the user station; setting a bit in an AID usage bitmap,wherein the bit corresponds to the assigned AID; and broadcasting theAID usage bitmap to other access points in the wireless network.
 4. Themethod of claim 1, further comprising: determining that the signalstrength associated with the user station is below a predeterminedthreshold; querying other access points for their signal strengthassociated with the same user station; and in response to there being atleast one other access point receiving a sufficiently strong signal fromthe user station, handing over the user station to the access point withthe strongest signal strength.
 5. The method of claim 1, furthercomprising: handing over one or more user stations associated with theaccess point to one or more other access points; and performingmaintenance on access point without disruption to service for the one ormore user stations that have been handed over.
 6. The method of claim 5,wherein performing maintenance comprises upgrading a firmware,performing spectrum scanning, or both.
 7. A wireless access point,comprising a processor and a memory coupled to the processor and storinginstructions which when executed by the processor cause the processor toperform a method for associating a user station with the access point,the method comprising: receiving a first authentication packet from theuser station; placing the user station in an association-arbitrationlist; broadcasting signal-strength indication associated with the userstation; receiving signal-strength indication associated with the userstation from other access points in the wireless network; determiningwhether the access point has the best signal strength associated withthe user station; and in response to the access point having the bestsignal strength, associating the user station with the access point. 8.The wireless access point of claim 7, wherein the method furthercomprises waiting for a predetermined period of time prior todetermining whether the access point has the best signal strength,thereby allowing sufficient time for receiving signal-strengthindication from other access points.
 9. The wireless access point ofclaim 7, wherein associating the user station with the access pointcomprises: assigning an AID to the user station; setting a bit in an AIDusage bitmap, wherein the bit corresponds to the assigned AID; andbroadcasting the AID usage bitmap to other access points in the wirelessnetwork.
 10. The wireless access point of claim 7, wherein the methodfurther comprises: determining that the signal strength associated withthe user station is below a predetermined threshold; querying otheraccess points for their signal strength associated with the same userstation; and in response to there being at least one other access pointreceiving a sufficiently strong signal from the user station, handingover the user station to the access point with the strongest signalstrength.
 11. The wireless access point of claim 7, wherein the methodfurther comprises: handing over one or more user stations associatedwith the access point to one or more other access points; and performingmaintenance on access point without disruption to service for the one ormore user stations that have been handed over.
 12. The wireless accesspoint of claim 11, wherein performing maintenance comprises upgrading afirmware, performing spectrum scanning, or both.
 13. A computer systemfor facilitating association of a user station with an access point in awireless network, the computer system comprising: a processor; areceiving mechanism operable to receive a first authentication packetfrom the user station; a placement mechanism operable to place the userstation in an association-arbitration list; a broadcast mechanismoperable to broadcast signal-strength indication associated with theuser station; wherein the receiving mechanism is further operable toreceive signal-strength indication associated with the user station fromother access points in the wireless network; a determination mechanismoperable to determine whether the access point has the best signalstrength associated with the user station; and an association mechanismoperable to, in response to the access point having the best signalstrength, associate the user station with the access point.
 14. Thecomputer system of claim 13, wherein the determination mechanism isfurther operable to wait for a predetermined period of time prior todetermining whether the access point has the best signal strength,thereby allowing sufficient time for receiving signal-strengthindication from other access points.
 15. The computer system of claim13, wherein while associating the user station with the access point,the association mechanism is further operable to: assign an AID to theuser station; set a bit in an AID usage bitmap, wherein the bitcorresponds to the assigned AID; and broadcast the AID usage bitmap toother access points in the wireless network.
 16. The computer system ofclaim 13, further comprising: a handover mechanism operable to hand overone or more user stations associated with the access point to one ormore other access points; and a maintenance mechanism operable toperform maintenance on access point without disruption to service forthe one or more user stations that have been handed over.
 17. Thecomputer system of claim 16, wherein while performing maintenance, themaintenance mechanism is operable to upgrade a firmware, performingspectrum scanning, or both.